Reliability-Based Transit Assignment for Congested Stochastic Transit Networks

Reliability-Based Transit Assignment for Congested Stochastic Transit Networks

This paper proposes a Nonlinear Complementarity Problem (NCP) formulation for the risk-aversive stochastic transit assignment problem in which in-vehicle travel time, waiting time, capacity and the effect of congestion are considered as stochastic variables simultaneously and both their means and variances are incorporated into the formulation. A new congestion model is developed and captured i...

The Reliability-Based Stochastic Transit Assignment Problem with Elastic Demand

This paper examines the reliability-based stochastic transit assignment problem with elastic demand. A Variational Inequality (VI) model for this problem is developed. The VI model considers capacity, waiting time and in-vehicle travel time as stochastic variables, and includes Spiess and Florian’s (1989) and de Cea and Fernández’s (1993) models as special cases. A reliability-based stochastic ...

Common-Lines and Passenger Assignment in Congested Transit Networks

A Transit Assignment Model on Stochastic Networks

In this paper, a transit assignment model has been developed on stochastic networks, with considering vehicle capacity and scheduled timetable. The stochastic network based transit assignment model is appropriate to apply for bus and metro networks altogether since it can distinguish between uncertain and reliable travel times characteristics by imposing stochastic parameters on links or lines....

Efficient Traffic Assignment for Public Transit Networks

We study the problem of computing traffic assignments for public transit networks: Given a public transit network and a demand (i.e. a list of passengers, each with associated origin, destination, and departure time), the objective is to compute the utilization of every vehicle. Efficient assignment algorithms are a core component of many urban traffic planning tools. In this work, we present a...